/*
 * GraphIntAdjList.c
 *
 *  Created on: 21/01/2012
 *      Author: marcio
 */

#include "GraphInt.h"

GraphInt* graph_newGraphInt(int n){

}

GraphInt* graphint_readGraphInt(FILE* filegraph){

}

GraphInt* graphint_complement(GraphInt* g){

}

GraphInt* graphint_homophism(GraphInt* g){

}

int graphint_addEdge(GraphInt* g, int v, int u){

}

int graphint_deleteEdge(GraphInt* g, int v, int u){

}

int graphint_hasEdge(GraphInt* g, int v, int u){

}

int graphint_degree(GraphInt* g, int v){

}

int* graphint_getNeigboorhood(GraphInt* g, int v){

}

int* graphint_getAntiNeigboorhood(GraphInt* g, int v){

}

int* graph_getCommunNeigboorhood(Graph* g, int* nodes, int r){
	//TODO
	return NULL;
}

int* graph_getCommumAntiNeigboorhood(Graph* g, int* nodes, int r){
	//TODO
	return NULL;
}

int* graph_getTotalNeigboorhood(Graph* g, int* nodes, int r){
	//TODO
	return NULL;
}

int* graph_getTotalAntiNeigboorhood(Graph* g, int* nodes, int r){
	//TODO
	return NULL;
}

void graphint_breathFirstSeacrh(GraphInt* g, int v, void (*action)(int)){

}

void graphint_deepFirstSeacrh(GraphInt* g, int v, void (*action)(int)){

}

int* graph_breathFirstList(Graph* g, int v){
	//TODO
	return NULL;
}


int* graph_deepFirstList(Graph* g, int v){
	//TODO
	return NULL;
}

void** graphint_getNodes(GraphInt* g){

}

